Category of asynchronous systems and polygonal morphisms
نویسنده
چکیده
A weak asynchronous system is a trace monoid with a partial action on a set. A polygonal morphism between weak asynchronous systems commutes with the actions and preserves the independence of events. We prove that the category of weak asynchronous systems and polygonal mor-phisms has all limits and colimits.
منابع مشابه
From torsion theories to closure operators and factorization systems
Torsion theories are here extended to categories equipped with an ideal of 'null morphisms', or equivalently a full subcategory of 'null objects'. Instances of this extension include closure operators viewed as generalised torsion theories in a 'category of pairs', and factorization systems viewed as torsion theories in a category of morphisms. The first point has essentially been treated in [15].
متن کاملCubical Sets and Trace Monoid Actions
This paper is devoted to connections between trace monoids and cubical sets. We prove that the category of trace monoids is isomorphic to the category of generalized tori and it is a reflective subcategory of the category of cubical sets. Adjoint functors between the categories of cubical sets and trace monoid actions are constructed. These functors carry independence preserving morphisms in th...
متن کاملOn morphisms of crossed polymodules
In this paper, we prove that the category of crossed polymodules (i.e. crossed modules of polygroups) and their morphisms is finitely complete. We, therefore, generalize the group theoretical case of this completeness property of crossed modules.
متن کاملThe category of generalized crossed modules
In the definition of a crossed module $(T,G,rho)$, the actions of the group $T$ and $G$ on themselves are given by conjugation. In this paper, we consider these actions to be arbitrary and thus generalize the concept of ordinary crossed module. Therefore, we get the category ${bf GCM}$, of all generalized crossed modules and generalized crossed module morphisms between them, and investigate som...
متن کاملThe and Concurrent Realizations of Reactive Systems
The problem of finding a (functorial) concurrent realization of a reactive system by means of a labelled safe Petri net is studied. Firstly, a (functorial) construction is described that leads from the category of concrete asynchronous systems introduced by Morin to the category of labelled safe Petri nets. Then, the general problem is discussed. It is indicated that in general there are no opt...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1308.1443 شماره
صفحات -
تاریخ انتشار 2013